Homophonic Coding and Random Number Generation

Efficient homophonic coding

Homophonic coding, or homophonic substitution, is referred to as a technique that contributes to reliability of the secret-key cipher systems. Its main goal is to convert the plaintext into a sequence of completely random (equiprobable and independent) code letters. In solving this problem three characteristics are to be considered: i) redundancy, defined as the difference between the mean code...

Random Number Generation 1

Universit e de Montr eal 2 4.1 INTRODUCTION Random numbers are the nuts and bolts of simulation. Typically, all the randomness required by the model is simulated by a random number generator whose output is assumed to be a sequence of independent and identically distributed (IID) U(0; 1) random variables (i.e., continuous random variables distributed uniformly over the interval (0; 1)). These r...

Random Number Generation

 AI algorithms like genetic algorithms and automated opponents.  Random game content and level generation.  Simulation of complex phenomena such as weather and fire.  Numerical methods such as Monte-Carlo integration.  Until recently primality proving used randomized algorithms.  Cryptography algorithms such as RSA use random numbers for key generation.  Weather simulation and other stat...

On Random Number Generation

Introduction Random numbers play a large and significant role in several fields and applications from cryptography to gaming to gambling. As a result, random number generators (RNGs) occupy a similarly important role. By their very nature, however, random numbers are difficult to fabricate, especially in the large quantities that they are often needed. In this paper I will discuss various topic...

A Universal Algorithm for Homophonic Coding